Congruences for $\sb 3F\sb 2$ hypergeometric functions over finite fields

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Special Values of Hypergeometric Functions over Finite Fields

For an odd prime p, define Hp(z) = ∑ u,v(mod p) ( uv(1−u)(1−v)(1−uvz) p ) , where z is an integer (mod p) and the summands are Legendre symbols. The function Hp(z) was explicitly evaluated for z = 1 by Evans (1981) and for z = −1 by Greene and Stanton (1986). Koike (1992) determined Hp(1/4)(mod p), and Ono (1998) evaluated Hp(z) for z = 1/4,−1/8, and 1/64. This paper evaluates Hp(z) for infinit...

متن کامل

Clausen's theorem and hypergeometric functions over finite fields

We prove a general identity for a 3F2 hypergeometric function over a finite field Fq, where q is a power of an odd prime. A special case of this identity was proved by Greene and Stanton in 1986. As an application, we prove a finite field analogue of Clausen’s Theorem expressing a 3F2 as the square of a 2F1. As another application, we evaluate an infinite family of 3F2(z) over Fq at z = −1/8. T...

متن کامل

Transformations of well-poised hypergeometric functions over finite fields

We define a hypergeometric function over finite fields which is an analogue of the classical generalized hypergeometric series. We prove that this function satisfies many transformation and summation formulas. Some of these results are analogous to those given by Dixon, Kummer and Whipple for the well-poised classical series. We also discuss this function’s relationship to other finite field an...

متن کامل

Symmetric functions over finite fields

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. The algorithm consists essentially of Gauss’ upper triangular form algorithm. It is proved that the basis of the ideal of algebraic relations found by the algorithm consists of polynomials having coefficie...

متن کامل

Limits of Boolean Functions over Finite Fields

In this thesis, we study sequences of functions of the form Fp → {0, 1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. One of the key tools we use is the recently developed theory of ‘higher order Fourier analysis’, where the characters of standard Fourier analysis are replaced with exponentials of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Illinois Journal of Mathematics

سال: 2002

ISSN: 0019-2082

DOI: 10.1215/ijm/1258130978